Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
Identifieur interne : 001662 ( Istex/Checkpoint ); précédent : 001661; suivant : 001663Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
Auteurs : R. Horst [Allemagne] ; Ng V. Thoai [Viêt Nam]Source :
- Journal of Optimization Theory and Applications [ 0022-3239 ] ; 1988-07-01.
Abstract
Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.
Url:
DOI: 10.1007/BF00939776
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name></author><author><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng V." last="Thoai">Ng V. Thoai</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</idno><date when="1988" year="1988">1988</date><idno type="doi">10.1007/BF00939776</idno><idno type="url">https://api.istex.fr/document/59E84C267DB12A35468BF8BB4B967CE4C8C7AD14/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000632</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000632</idno><idno type="wicri:Area/Istex/Curation">000591</idno><idno type="wicri:Area/Istex/Checkpoint">001662</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001662</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities</title><author><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV-Mathematik, Universität Trier, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation></author><author><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng V." last="Thoai">Ng V. Thoai</name><affiliation wicri:level="1"><country xml:lang="fr">Viêt Nam</country><wicri:regionArea>Institute of Mathematics, Hanoi</wicri:regionArea><wicri:noRegion>Hanoi</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Optimization Theory and Applications</title><title level="j" type="abbrev">J Optim Theory Appl</title><idno type="ISSN">0022-3239</idno><idno type="eISSN">1573-2878</idno><imprint><publisher>Kluwer Academic Publishers-Plenum Publishers</publisher><pubPlace>New York</pubPlace><date type="published" when="1988-07-01">1988-07-01</date><biblScope unit="volume">58</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="139">139</biblScope><biblScope unit="page" to="145">145</biblScope></imprint><idno type="ISSN">0022-3239</idno></series><idno type="istex">59E84C267DB12A35468BF8BB4B967CE4C8C7AD14</idno><idno type="DOI">10.1007/BF00939776</idno><idno type="ArticleID">BF00939776</idno><idno type="ArticleID">Art10</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0022-3239</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: In this note, we show how branch-and-bound methods previously proposed for solving broad classes of multiextremal global optimization problems can be applied for solving systems of Lipschitzian equations and inequalities over feasible sets defined by various types of constraints. Some computational results are given.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Viêt Nam</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Horst, R" sort="Horst, R" uniqKey="Horst R" first="R." last="Horst">R. Horst</name></noRegion></country><country name="Viêt Nam"><noRegion><name sortKey="Thoai, Ng V" sort="Thoai, Ng V" uniqKey="Thoai N" first="Ng V." last="Thoai">Ng V. Thoai</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001662 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 001662 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:59E84C267DB12A35468BF8BB4B967CE4C8C7AD14
|texte= Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
}}
| This area was generated with Dilib version V0.6.31. |  |